Maximum Likelihood BSC Parameter Estimation for the Slepian-Wolf Problem
نویسندگان
چکیده
منابع مشابه
Maximum Likelihood Parameter Estimation
The problem of estimating the parameters for continuous-time partially observed systems is discussed. New exact lters for obtaining Maximum Likelihood (ML) parameter estimates via the Expectation Maximization algorithm are derived. The methodology exploits relations between incomplete and complete data likelihood and gradient of likelihood functions, which are derived using Girsanov's measure t...
متن کاملDistributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed “distributed arithmetic coding”, which exploits the fact that arithmetic codes are good source as well as channel codes. In particular, we propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along wit...
متن کاملMaximum-Likelihood Circle-Parameter Estimation via Convolution
In this paper, we present an interpretation of the Maximum Likelihood Estimator (MLE) and the Delogne-Kåsa Estimator (DKE) for circle-parameter estimation via convolution. Under a certain model for theoretical images, this convolution is an exact description of the MLE. We use our convolution based MLE approach to find good starting estimates for the parameters of a circle, that is, the centre ...
متن کاملCoding for the Slepian-Wolf problem with turbo codes
This paper proposes a practical coding scheme for the Slepian-Wolf problem of separate encoding of correlated sources. Finite-state machine (FSM) encoders, concatenated in parallel, are used at the transmit side and an iterative turbo decoder is applied at the receiver. Simulation results of system performance are presented for binary sources with different amounts of correlation. Obtained resu...
متن کاملDistributed arithmetic coding for the Slepian-Wolf problem
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, named “distributed arithmetic coding”, which extends arithmetic codes to the distributed case employing sequential decoding aided by the side information. In particular, we introduce a distributed binary arithmetic coder for the Slepian-Wolf coding problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2011
ISSN: 1089-7798
DOI: 10.1109/lcomm.2011.122810.102182